Some comparison results with new effective preconditioners for L-matrices
نویسنده
چکیده
Based on the work of Wang and Li [A new preconditioned AOR iterative method for L-matrices, J. Comput. Appl. Math. 229 (2009) 47-53], in this paper, a new preconditioner for the AOR method is proposed for solving linear systems whose coefficient matrix is an L-matrix. Several comparison theorems are shown for the proposed method with two preconditioners. It follows from the comparison results that the proposed new method can achieve faster convergence than the preconditioner introduced by Wang and Li. Key–Words: Preconditioner; L-matrix; AOR mehtod; SOR mehtod
منابع مشابه
Convergence Analysis of Some New Preconditioned AOR Iterative Methods for L-matrices
In this paper, we present a new preconditioner which generalizes two known preconditioners proposed by Wang et al. (2009) and A. J. Li (2011), and prove that the convergence rate of the AOR method with the new preconditioner is faster than the preconditioners introduced by Wang et al. Moreover, we propose other two new preconditioners and study the convergence rates of the new preconditioned AO...
متن کاملSome Preconditioners for Block Pentadiagonal Linear Systems Based on New Approximate Factorization Methods
In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal linear systems suitable for vectors and parallel processors, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are appropriate when the desired target is to maximize parallelism. Moreover, some theoretical results about these pre...
متن کاملA Note on Superoptimal Generalized Circulant Preconditioners
Circulant matrices can be effective preconditioners for linear systems of equations with a Toeplitz matrix. Several approaches to construct such preconditioners have been described in the literature. This paper focuses on the superoptimal circulant preconditioners proposed by Tyrtyshnikov, and investigates a generalization obtained by allowing generalized circulant matrices. Numerical examples ...
متن کاملCombinatorial Preconditioners for Scalar Elliptic Finite-Element Problems
We present a new preconditioner for linear systems arising from finite-element discretizations of scalar elliptic partial differential equations (PDE’s). The solver splits the collection {Ke} of element matrices into a subset of matrices that are approximable by diagonally dominant matrices and a subset of matrices that are not approximable. The approximable Ke’s are approximated by diagonally ...
متن کاملStructured preconditioners for nonsingular matrices of block two-by-two structures
For the large sparse block two-by-two real nonsingular matrices, we establish a general framework of practical and efficient structured preconditioners through matrix transformation and matrix approximations. For the specific versions such as modified block Jacobi-type, modified block GaussSeidel-type, and modified block unsymmetric (symmetric) Gauss-Seidel-type preconditioners, we precisely de...
متن کامل